On Numerically Verifiable Exactness of Multiplier Relaxations
نویسنده
چکیده
Robust semi-definite programming problems with rational dependence on uncertainties are known to have a wide range of applications, in particular in robust control. It is well-established how to systematically construct relaxations on the basis of the full block S-procedure. In general such relaxations are expected to be conservative, but for concrete problem instances they are often observed to be tight. The main purpose of this paper is to investigated in how far recently suggested tests for the exactness of such relaxations are indeed numerically verifiable. Copyright c ©2005 IFAC
منابع مشابه
Semidefinite Programming Relaxations for the Quadratic Assignment Problem
Semideenite programming (SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of QAP. These relaxations result in the interesting, special, case where only the dual problem of the SDP relaxation has strict interior, i.e. the Slater constraint qualii-cation always fails for the primal...
متن کاملTreewidth-based conditions for exactness of the Sherali-Adams and Lasserre relaxations
The Sherali-Adams (SA) and Lasserre (LS) approaches are “lift-and-project” methods that generate nested sequences of linear and/or semidefinite relaxations of an arbitrary 0-1 polytope P ⊆ [0, 1]n. Although both procedures are known to terminate with an exact description of P after n steps, there are various open questions associated with characterizing, for particular problem classes, whether ...
متن کاملSparse learning via Boolean relaxations
We introduce novel relaxations for cardinality-constrained learning problems, including least-squares regression as a special but important case. Our approach is based on reformulating a cardinality-constrained problem exactly as a Boolean program, to which standard convex relaxations such as the Lasserre and Sherali-Adams hierarchies can be applied. We analyze the first-order relaxation in det...
متن کاملMatrix Sum-of-Squares Relaxations for Robust Semi-Definite Programs
Received: date / Revised version: date Abstract. We consider robust semi-definite programs which depend polynomially or rationally on some uncertain parameter that is only known to be contained in a set with a polynomial matrix inequality description. On the basis of matrix sum-of-squares decompositions, we suggest a systematic procedure to construct a family of linear matrix inequality relaxat...
متن کاملJordan-Algebraic Approach to Convexity Theorems for Quadratic Mappings
We describe a Jordan-algebraic version of results related to convexity of images of quadratic mappings as well as related results on exactness of symmetric relaxations of certain classes of nonconvex optimization problems. The exactness of relaxations is proved based on rank estimates. Our approach provides a unifying viewpoint on a large number of classical results related to cones of Hermitia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005